Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination
نویسندگان
چکیده
منابع مشابه
Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
We study Dickson bases for binary field representation. Such representation seems interesting when no optimal normal basis exists for the field. We express the product of two elements as Toeplitz or Hankel matrix vector product. This provides a parallel multiplier which is subquadratic in space and logarithmic in time.
متن کاملLow space complexity CRT-based bit-parallel GF(2n) polynomial basis multipliers for irreducible trinomials
By selecting the largest possible value of k ∈ (n/2, 2n/3], we further reduce the AND and XOR gate complexities of the CRT-based hybrid parallel GF (2) polynomial basis multipliers for the irreducible trinomial f = u + u + 1 over GF (2): they are always less than those of the current fastest parallel multipliers – quadratic multipliers, i.e., n AND gates and n− 1 XOR gates. Our experimental res...
متن کاملSubquadratic Binary Field Multiplier in Double Polynomial System
We propose a new space efficient operator to multiply elements lying in a binary field F2k . Our approach is based on a novel system of representation called Double Polynomial System which set elements as a bivariate polynomials over F2. Thanks to this system of representation, we are able to use a Lagrange representation of the polynomials and then get a logarithmic time multiplier with a spac...
متن کاملComment on "Subquadratic Space-Complexity Digit-Serial Multipliers Over GF(2m) Using Generalized (a, b)-Way Karatsuba Algorithm"
Karatsuba algorithm (KA) is popularly used for high-precision multiplication by a divide-and-conquer approach. Recently, subquadratic digit-serial multiplier based on (a, 2)way KA decomposition is proposed in [1]. In this paper, we extend a (a, 2)-way KA to derive a generalized (a, b)-way KA decomposition with a 6= b. We have shown that (a, 2)-way KA and mult-way KA are special cases of the pro...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2014
ISSN: 0018-9340
DOI: 10.1109/tc.2013.105